#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  rep(i, 1, n) cin >> a[i];
  priority_queue<int> mn;
  priority_queue<int, vector<int>, greater<int>> mx;
  rep(i, 1, n) {
    if (mn.size() && mn.top() > a[i])
      mn.push(a[i]);
    else
      mx.push(a[i]);
    int k = max(1, i * m / 100);
    while (mx.size() > k) mn.push(mx.top()), mx.pop();
    while (mx.size() < k) mx.push(mn.top()), mn.pop();
    cout << mx.top() << ' ';
  }
  return 0;
}